Verified computations for closed hyperbolic 3‐manifolds
نویسندگان
چکیده
منابع مشابه
Verified Computations for Hyperbolic 3-Manifolds
Recent progress in field of 3-manifold topology has confirmed that each 3-manifold can be decomposed in to pieces that admit a geometric structure modelled on the quotient of one of eight simply connected spaces (for further background see the references below). By most accounts, the most common, and yet least understood of these geometric structures is the hyperbolic structure. A manifold M ad...
متن کاملVerified Homology Computations for Nodal Domains
Homology has long been accepted as an important computational tool for quantifying complex structures. In many applications these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study based on suitable discretizations. Such an approach immediately raises the question of how accurately the resulting homology can be computed. In this paper...
متن کاملCompiling computations to constraints for verified computation
We present a compiler that automates the task of converting high-level code to constraint sets of the form accepted by the Ginger and Zaatar protocols for verified computation. Performing the conversion from high-level code to constraints by hand is prone to human error and therefore not practical for large computations. This paper evaluates the performance of the compiler and the effectiveness...
متن کاملOn Verified Numerical Computations in Convex Programming
This survey contains recent developments for computing verified results of convex constrained optimization problems, with emphasis on applications. Especially, we consider the computation of verified error bounds for non-smooth convex conic optimization in the framework of functional analysis, for linear programming, and for semidefinite programming. A discussion of important problem transforma...
متن کاملWYS: A Verified Language Extension for Secure Multi-party Computations
Secure multi-party computation (MPC) enables a set of mutually distrusting parties to cooperatively compute, using a cryptographic protocol, a function over their private data. This paper presents WYS, a new domain-specific language (DSL) implementation for writing MPCs. WYS is a Verified, Domain-Specific Integrated Language Extension (VDSILE), a new kind of embedded DSL hosted in F, a fullfeat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the London Mathematical Society
سال: 2020
ISSN: 0024-6093,1469-2120
DOI: 10.1112/blms.12445